Object grammars and bijections
نویسندگان
چکیده
A new systematic approach for the speciication of bijections between sets of combinatorial objects is presented. It is based on the notion of object grammars. Object grammmars are recursive descriptions of objects which generalize context free grammars. The study of a particular substitution in these object grammars connrms once more the key role of Dyck words in the domain of enumerative and bijective combinatorics.
منابع مشابه
Ordered Construction of Combinatorial Objects
The generating function method for counting species of combinatorial objects is applied to the construction of the objects in order. The species considered are those described using context-free grammars with additional group-invariant operators. Some species constructible with this method are integer partitions, rooted trees of specified or unbounded degree including binary and ordered trees, ...
متن کاملspaces ∗
We establish natural bijections between three different classes of combinatorial objects; namely certain families of locally 2–arc transitive graphs, partial linear spaces, and homogeneous factorisations of arc-transitive graphs. Moreover, the bijections intertwine the actions of the relevant automorphism groups. Thus constructions in any of these areas provide examples for the others.
متن کاملRecursive Bijections for Catalan Objects
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions posed by R. Stanley in the addendum to his textbook. We actually discuss two types of bijection, one defined recursively and the other defined in a more loca...
متن کاملBijections between noncrossing and nonnesting partitions for classical reflection groups
We present type preserving bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types B, C and D are new in the literature. To find them we define, for every type, sets of statistics that are in bijection with noncrossing and nonnesting partitions, and this correspon...
متن کاملAn algorithm to describe bijections involving Dyck paths
We use an algorithm to define bijections involving Dyck paths. This algorithm is parametrized by rewriting rules and is similar to the derivation of a word in a context-free grammar. The bijections are variations of a classical one which is based on the insertion of a peak in the last descent. A systematic study of the algorithms parametrized by a single rewriting rule leads to 6 bijections, ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 290 شماره
صفحات -
تاریخ انتشار 2003